Vertex fusion under distance constraints
نویسندگان
چکیده
منابع مشابه
Vertex fusion under distance constraints
In this paper, we analyze parameter improvement under vertex fusion in a graph G. This is a setting in which a new graph G is obtained after identifying a subset of vertices of G in a single vertex. We are interested in distance parameters, in particular diameter, radius and eccentricity of a vertex v. We show that the corresponding problem is NP-Complete for the three parameters. We also find ...
متن کاملVertex fusion under diameter constraints
Given a graph G=(V ,E), a positive integer k and a positive integer d, we want find a subset Vk with k vertices such the graph obtained by identifying the vertices from Vk in G has diameter at most d. We prove that for every d ≥ 2 the problem is NP-complete. For the case of trees we provide a polynomial time algorithm that exploits the relationship with the r-dominating set problem.
متن کاملRepairing Vertex Labels under Neighborhood Constraints
A broad class of data, ranging from similarity networks, workflow networks to protein networks, can be modeled as graphs with data values as vertex labels. The vertex labels (data values) are often dirty for various reasons such as typos or erroneous reporting of results in scientific experiments. Neighborhood constraints, specifying label pairs that are allowed to appear on adjacent vertexes i...
متن کاملTwo-Page Book Embedding of Trees under Vertex-Neighborhood Constraints
We study the VLSI-related problem of embedding .graphs in books. A book embedding of a graph G=(V,E) consists.of two parts; namely, (1) an ordering of ~ along the spine of the book, and (2) an assignment of each ee E to a page of the book, so that edges assigned to the same page do nOt int§. In devising an.embedding, one seeks to minimize the number of pages used. A black/white (blw) graph ...
متن کاملOne-page book embedding under vertex-neighborhood constraints
We study the VLSI-related problem of embedding graphs in books. A book embedding of a graph G =(V ,E) consists of two parts, namely, (1) an ordering of V along the spine of the book, and (2) an assignment of each eE E to a page of the book, so that edges assigned to the same page do not intersect. In devising an-embedding, one seeks to minimi;ze the number of pages used. This paper addresses a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2009
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2009.03.014